Grokking LinkedIn Coding Interview
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Who Should Take This Course?
LinkedIn Easy
Find Pivot Index (easy)
Solution: Find Pivot Index
Isomorphic Strings (easy)
Solution: Isomorphic Strings
Second Minimum Node In a Binary Tree (easy)
Solution: Second Minimum Node In a Binary Tree
Minimum Time to Type Word Using Special Typewriter (easy)
Solution: Minimum Time to Type Word Using Special Typewriter
Intersection of Two Arrays (easy)
Solution: Intersection of Two Arrays
Can Place Flowers (easy)
Solution: Can Place Flowers
Valid Perfect Square (easy)
Solution: Valid Perfect Square
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Sqrt (easy)
Solution: Sqrt
Valid Palindrome (easy)
Solution: Valid Palindrome
LinkedIn Medium
Rotate List (medium)
Solution: Rotate List
Find Leaves of Binary Tree (medium)
Solution: Find Leaves of Binary Tree
Valid Triangle Number (medium)
Solution: Valid Triangle Number
Valid Parenthesis String (medium)
Solution: Valid Parenthesis String
Edit Distance (medium)
Solution: Edit Distance
Remove All Ones With Row and Column Flips II (medium)
Solution: Remove All Ones With Row and Column Flips II
Reverse Integer (medium)
Solution: Reverse Integer
Triplet Sum to Zero (medium)
Solution: Triplet Sum to Zero
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)
Decode Ways (medium)
Solution: Decode Ways
Quadruple Sum to Target (medium)
Solution: Quadruple Sum to Target
Next Permutation (medium)
Solution: Next Permutation
Search in Rotated Array (medium)
Solution: Search in Rotated Array
Word Search (medium)
Solution: Word Search
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
House Robber II (medium)
Solution: House Robber II
Coin Change
Solution: Coin Change
Design Add and Search Words Data Structure (medium)
Solution: Design Add and Search Words Data Structure
Merge Intervals (medium)
Solution: Merge Intervals
Number of Islands (easy)
Solution: Number of Islands
Longest Palindromic Subsequence (medium)
Solution: Longest Palindromic Subsequence
Kth Smallest Number (medium)
Solution: Kth Smallest Number
Maximum Product Subarray (medium)
Solution: Maximum Product Subarray
Same Tree (medium)
Solution: Same Tree
Max Points on a Line (hard)
Solution: Max Points on a Line
Closest Binary Search Tree Value II (hard)
Solution: Closest Binary Search Tree Value II
Word Ladder (hard)
Solution: Word Ladder
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Serialize and Deserialize Binary Tree (hard)
Solution: Serialize and Deserialize Binary Tree
Solution: Next Permutation

Problem Statement

Given an array of integers nums, return the next permutation of nums.

A permutation of the array is an arrangement of its elements in the linear order or particular sequence.

  • For example, permutations of the [2, 1, 3] array are [3,2,1], [3,1,2], [1,2,3], [1,3,2], [2, 1, 3], and [2, 3, 1].

A next permutation of the array is the next smallest lexicographically greater permutation of array elements.

  • For example, next permutation of [2, 1, 3] is [2, 3, 1], which is smallest lexicographically greater permutation.

If no higher permutation is possible, the array should be rearranged into its lowest possible order (ascending).

  • For example, next permutation for [3, 2, 1] is [1, 2, 3] as [3, 2, 1] doesn't have lexicographically larger permutation.

Examples

  • Example 1:

    • Input: [1, 3, 5, 4, 2]
    • Expected Output: [1, 4, 2, 3, 5]
    • Justification: The next permutation is obtained by swapping 3 with the next higher number (4) and then sorting the numbers after 4 in ascending order.
  • Example 2:

    • Input: [2, 3, 6, 5, 4, 1]
    • Expected Output: [2, 4, 1, 3, 5, 6]
    • Justification: The next permutation is found by swapping 3 with the next higher number (4) in the sequence following it and then sorting the numbers after 4 in ascending order.
  • Example 3:

    • Input: [1, 1, 5]
    • Expected Output: [1, 5, 1]
    • Justification: The next immediate permutation after [1, 1, 5] is [1, 5, 1].

Solution

To solve this problem, the key idea is to modify the sequence slightly to obtain the next greater arrangement of numbers. This approach can be visualized as follows: starting from the right end of the array, we look for the first pair of consecutive numbers where the left number is smaller than the right one. This left number is termed as the 'pivot'. The pivot is the number that we need to increase to get the next higher permutation. However, to ensure the smallest increase and maintain the order of a valid next permutation, we swap the pivot with the smallest number that is greater than it among the numbers to its right. After the swap, the sequence to the right of the original pivot position is reversed to ensure we get the lowest possible sequence there, completing the formation of the next permutation. This approach ensures we find the next permutation in an efficient and methodical way, without the need for generating all permutations.

This method is effective as it leverages the properties of permutations - an ordered arrangement of numbers. By making minimal changes - a single swap and a reversal, we move directly to the next sequence that is numerically just above the current one. This approach is efficient as it operates in linear time complexity, avoiding any unnecessary computations.

Step-by-step Algorithm

  1. Initialize Variables:

    • Let n be the length of the input array nums.
    • Initialize pivot to -1. The pivot variable will store the index of the pivot element we find.
  2. Find the Pivot:

    • Iterate backwards from the second last element (index n - 2) to the start of the array.
    • If an element nums[i] is found such that nums[i] < nums[i + 1], set pivot = i. Break the loop.
  3. Find the Successor (if Pivot is Found):

    • If pivot is not -1 (pivot exists), iterate backwards from the last element (index n - 1) to find the successor.
    • Find the smallest element nums[j] such that nums[j] > nums[pivot].
  4. Swap Pivot and Successor:

    • If a pivot was found (pivot != -1), swap the elements nums[pivot] and nums[j].
  5. Reverse the Sequence after Pivot Position:

    • Reverse the sub-array of nums starting from pivot + 1 to the end of the array.
    • This can be done by swapping elements symmetrically around the midpoint of the sub-array from pivot + 1 to n - 1.

Algorithm Walkthrough

  • Take the input [2, 3, 6, 5, 4, 1].
  • Find the pivot: The rightmost digit smaller than its right neighbor is 3 (since 3 is smaller than 6).
  • Find the successor: The smallest digit larger than 3 in the sequence to its right is 4.
  • Swap 3 and 4, the array becomes [2, 4, 6, 5, 3, 1].
  • Reverse the sequence after 4, which is [6, 5, 3, 1], to get [1, 3, 5, 6].
  • The array after reversal is [2, 4, 1, 3, 5, 6].
  • Final result is [2, 4, 1, 3, 5, 6].

Code

Java
Saved to Cloud

. . . .

Complexity Analysis

  • Time Complexity: The algorithm runs in O(N) time, where N is the number of elements in the array. This efficiency is due to linear scans to find the pivot and successor, and a single reverse operation.
  • Space Complexity: O(1), as the rearrangement is done in-place with no need for extra space.
Next Permutation (medium)
Search in Rotated Array (medium)
Mark as Completed

On this page

Problem Statement

Examples

Solution

Step-by-step Algorithm

Algorithm Walkthrough

Code

Complexity Analysis